What a load of rankers.
نویسنده
چکیده
different ages: evidence from the UK audit of screening histories. Br J Cancer 2003; 89: 88–93. 9 Sasieni P, Castanon A, Parkin DM. How many cervical cancers are prevented by treatment of screen-detected disease in young women? Int J Cancer 2009; 124: 461–464. 10 Sigurdsson K, Sigvaldason H. Is it rational to start populationbased cervical cancer screening at or soon after age 20? Analysis of time trends in pre-invasive and invasive diseases. Eur J Cancer 2007; 43: 769–774. 11 Herbert A, Holdsworth G, Kubba A. Cervical screening: why young women should be encouraged to be screened. J Fam Plann Reprod Health Care 2008; 34: 21–25. 12 Wellings K, Nanchahal K, Macdowall W, McManus S, Erens B, Mercer CH, et al. Sexual behaviour in Britain: early heterosexual experience. Lancet 2001; 358: 1843–1850.
منابع مشابه
Multileaving for Online Evaluation of Rankers
In online learning to rank we are faced with a tradeoff between exploring new, potentially superior rankers, and exploiting our preexisting knowledge of what rankers have performed well in the past. Multileaving methods offer an attractive approach to this problem since they can efficiently use online feedback to simultaneously evaluate a potentially arbitrary number of rankers. In this talk we...
متن کاملBayesian Aggregation of Order-Based Rank Data
Rank aggregation, that is, combining several ranking functions (called base rankers) to get aggregated, usually stronger rankings of a given set of items, is encountered in many disciplines. Most methods in the literature assume that base rankers of interest are equally reliable. It is very common in practice, however, that some rankers are more informative and reliable than others. It is desir...
متن کاملRankers over Infinite Words
We consider the fragments FO, Σ2 ∩ FO, Π2 ∩ FO, and ∆2 of first-order logic FO[<] over finite and infinite words. For all four fragments, we give characterizations in terms of rankers. In particular, we generalize the notion of a ranker to infinite words in two possible ways. Both extensions are natural in the sense that over finite words, they coincide with classical rankers and over infinite ...
متن کاملInformation vs. Robustness in Rank Aggregation: Models, Algorithms and a Statistical Framework for Evaluation
The rank aggregation problem has been studied extensively in recent years with a focus on how to combine several different rankers to obtain a consensus aggregate ranker. We study the rank aggregation problem from a different perspective: how the individual input rankers impact the performance of the aggregate ranker. We develop a general statistical framework based on a model of how the indivi...
متن کاملCost-Effective Combination of Multiple Rankers: Learning When Not To Query
Combining multiple rankers has potential for improving the performance over using any of the single rankers. However, querying multiple rankers for every search request can often be too costly due to efficiency or commercial reasons. In this work, we propose a more cost-effective approach that predicts the utility of any additional rankers, prior to querying them. We develop a combined measure ...
متن کاملDifferent Rankers on Different Subcollections
Recent work has shown that when documents in a TREC ad hoc collection are partitioned, different rankers will perform optimally on different partitions. This result suggests that choosing different highly effective rankers for each partition and merging the results, should be able to improve overall effectiveness. Analyzing results from a novel oracle merge process, we demonstrate that this is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The journal of family planning and reproductive health care
دوره 35 2 شماره
صفحات -
تاریخ انتشار 2009